Minimal Sets of Visibility

نویسنده

  • F. A. VALENTINE
چکیده

Let 5 be a set in an «-dimensional Euclidean space, E„. The following concept was used by Horn and Valentine [2] in their study of L sets, and it provides the basis of this investigation. Definition 1. A set VES is a set of visibility in S if, given any point p ES, there exists a point qEV such that the closed segment pqQS. Notation. Given a point xES, let Vix) denote a continuum1 of visibility in 5 which contains x. The notation V,ix) will also be used. Definition 2. The set Vix) is a minimal continuum of visibility in S relative to x if, for any other continuum of visibility 7i(x), we have ViixXtVix). A corresponding definition holds if we replace the word "continuum" by the words "compact convex set." It is our purpose to investigate sets for which Vix) is unique for each xES. The most interesting result is contained in Theorem 2. The corresponding theory in which maximal convex sets are considered has been developed by Strauss and Valentine [3]. The two theories are decidedly different, and this difference is explained at the end of this article.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System

In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...

متن کامل

Tree-visibility orders

We introduce a new class of partially ordered sets, called tree-visibility orders, containing interval orders, duals of generalized interval orders and height one orders. We give a characterization of tree-visibility orders by an innnite family of minimal forbidden suborders. Furthermore we present an eecient recognition algorithm for tree-visibility orders.

متن کامل

Some results on maximal open sets

In this paper, the notion of maximal m-open set is introduced and itsproperties are investigated. Some results about existence of maximal m-open setsare given. Moreover, the relations between maximal m-open sets in an m-spaceand maximal open sets in the corresponding generated topology are considered.Our results are supported by examples and counterexamples.

متن کامل

Order Types and Visibility Types of Conngurations of Disjoint Convex Plane Sets Order Types and Visibility Types of Conngurations of Disjoint Convex Plane Sets Extended Abstract

We introduce the notions of order type (or: dual arrangement) and visibility type (or: tangent visibility graph) for conngurations of disjoint convex sets in the plane. We develop optimal algorithms for computing and sweeping the order type, and also give a worst case optimal algorithm for computing the tangent visibility graph. The methods are based on a relation, introduced in this paper, bet...

متن کامل

Tree-visibility Orders Tree-visibility Orders

In this paper we introduce a new class of partially ordered sets, called tree-visibility orders, extending the class of interval orders in a fashion similar to the extension of interval graphs to chordal graphs. This class contains interval orders, duals of generalized interval orders and height one orders. We give a characterization of tree-visibility orders by an innnite family of minimal for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010